Weak Diamond and Open Colorings
نویسنده
چکیده
The purpose of this article is to prove the relative consistency of certain statements about open colorings with 2א0 < 2א1 . In particular both OCA and the statement that every 1-1 function of size א1 is σ-monotonic are consistent with 2א0 < 2א1 . As a corollary we have that 2א0 < 2א1 does not admit a Pmax variation (in the presence of an inaccessible cardinal). The open coloring axiom, OCA, is a Ramsey theoretic statement relating to the real numbers. Since its introduction in [17] it has found a wealth of applications to problems closely related to the real line (see [5], [7], [13], [17], [19], and [20]). Frequently, applications of OCA require an application of MAא1 to complete the argument (see, e.g., [7], [20]). Farah gave some explanation of this phenomenon through the following theorem. Theorem 0.1. [6] OCA is relatively consistent with (1) t = א1. (2) There are no Q-sets. (3) There are two א1 dense sets of reals which are not order isomorphic. Since items 1-3 are all consequences of weak diamond (an equivalent of 2א0 < 2א1 — see [4]) this suggests the question of whether OCA is relatively consistent with weak diamond. In this paper I will show that this is indeed the case. I will also show the relative consistency of weak diamond with “Every partial 1-1 function f ⊆ R of size א1 is the union of countably many monotonic functions.” An application of the later result is that there is no Pmax variation for weak diamond (see [21] for a discussion of Pmax models and their variants). In particular there are two consequences of the bounded form of PFA which jointly imply 2א0 = 2א1 but which are each relatively consistent with 2א0 < 2א1 (one of them modulo an inaccessible cardinal). I would like to thank Ilijas Farah and Paul Larson for reading drafts of this paper and offering a number of useful suggestions. The research for this paper was supported by EPSRC grant GR/M71121 during my stay at the University of East Anglia.
منابع مشابه
Ladder Systems on Trees
We formulate the notion of uniformization of colorings of ladder systems on subsets of trees. We prove that Suslin trees have this property and also Aronszajn trees in the presence of Martin’s Axiom. As an application we show that if a tree has this property, then every countable discrete family of subsets of the tree can be separated by a family of pairwise disjoint open sets. Such trees are t...
متن کاملWeak Conflict-Free Colorings of Point Sets and Simple Regions
In this paper we consider the weak conflict-free colorings of regions and points. This is a natural relaxation of conflict-free coloring [ELRS03]. One of the most interesting type of regions to consider for this problem is that of the axis-parallel rectangles. We completely solve the problem for a special case of them, for bottomless rectangles. We also give complete answer for half-planes and ...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملPolynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes
We design an O(n) algorithm to find a minimum weighted coloring of a (P5, P 5)free graph. Furthermore, the same technique can be used to solve the same problem for several classes of graphs, defined by forbidden induced subgraphs, such as (diamond, co-diamond)-free graphs.
متن کاملPatch Colorings and Rigid Colorings of the Rational n-Space
We investigate k-colorings of the rational n-space, Q, such that any two points at distance one get distinct colors. Two types of colorings are considered: patch colorings where the colors occupy open sets with parts of their boundary, and rigid colorings which uniquely extend from any open subset of Q. We prove that the existence of a patch k-coloring of Q implies the existence of a k-coloring...
متن کامل